Encompassing colored crossing-free geometric graphs
نویسندگان
چکیده
Given n red and n blue points in the plane and a planar straight line matching between the red and the blue points, the matching can be extended into a bipartite planar straight line spanning tree. That is, any red-blue planar matching can be completed into a crossing-free red-blue spanning tree. Such a tree can be constructed in O(n log n) time. keywords: geometric graph, spanning tree, color
منابع مشابه
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
We consider the problem of deciding whether or not a geometric graph has a crossing-free spanning tree. This problem is known to be NP-hard even for very restricted types of geometric graphs. In this paper, we present an O(n) time algorithm to solve this problem for the special case of geometric graphs that arise as visibility graphs of a finite set of n points between two monotone polygonal ob...
متن کاملNumber of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant α > 0 such that, for any set P of n ≥ 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at random contains, in expectation, at least (12 + α)M edges, where M denotes the number of edges in any triangulation of P . From this we derive (to our knowledge) the first non-trivial upper bound of the form cn · tr(P ...
متن کاملJones Polynomials, Volume and Essential Knot Surfaces: a Survey
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [18, 19], while this survey focuses on the main ideas and examples. Introduction. To every knot in S3 there corresponds a 3-manifold, namely the knot complement. This 3-manifold decomposes along tori into geometric pieces, whe...
متن کاملCrossings in Grid Drawings
We prove tight crossing number inequalities for geometric graphs whose vertex sets are taken from a d-dimensional grid of volume N and give applications of these inequalities to counting the number of crossing-free geometric graphs that can be drawn on such grids. In particular, we show that any geometric graph with m ≥ 8N edges and with vertices on a 3D integer grid of volumeN , has Ω((m2/n) l...
متن کاملProperly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
Let X be a set of multicolored points in the plane such that no three points are collinear and each color appears on at most ⌈|X|/2⌉ points. We show the existence of a non-crossing properly colored geometric perfect matching on X (if |X| is even), and the existence of a non-crossing properly colored geometric spanning tree with maximum degree at most 3 on X. Moreover, we show the existence of a...
متن کامل